//
// Created by 下次一定 on 2021/9/5.
// 离散化  区间很长 但是用到的点比较少
//


#include <iostream>
#include<vector>
#include<algorithm>


using namespace std;

typedef pair<int, int> PII;

int n, m;
const int N = 300010;
int a[N], s[N];

vector<int> alls;
vector<PII> add, query;

//找到合适的坐标
int find(int x) {
    int l = 0, r = alls.size() - 1;
    while (l < r) {
        int mid = l + r >> 1;
        if (alls[mid] >= x) r = mid;
        else l = mid + 1;
    }
    return r + 1;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int x, c;
        cin >> x >> c;
        add.push_back({x, c});
        alls.push_back(x);
    }

    for (int i = 0; i < m; i++) {
        int l, r;
        cin >> l >> r;
        query.push_back({l, r});
        alls.push_back(l);
        alls.push_back(r);
    }

    sort(alls.begin(), alls.end());
    alls.erase(unique(alls.begin(), alls.end()), alls.end());

    //处理插入
    for (auto item : add) {
        int x = find(item.first);
        a[x] += item.second;
    }

    //预处理前缀和
    for (int i = 1; i <= alls.size() - 1; i++) s[i] = s[i - 1] + a[i];

    //处理查询
    for (auto item : query) {
        int l = item.first;
        int r = item.second;
        cout << s[r] - s[l - 1] << endl;

    }

}